Generalized de Bruijn words for primitive words and powers
نویسندگان
چکیده
منابع مشابه
Burrows-Wheeler transformations and de Bruijn words
We formulate and explain the extended Burrows–Wheeler transform ofMantaci et al. from the viewpoint of permutations on a chain taken as a union of partial order-preserving mappings. In so doing we establish a link with syntactic semigroups of languages that are themselves cyclic semigroups.We apply the extended transformwith a view to generating de Bruijn words through inverting the transform. ...
متن کاملPrimitive words and roots of words
In the algebraic theory of codes and formal languages, the set Q of all primitive words over some alphabet Σ has received special interest. With this survey article we give an overview about relevant research to this topic during the last twenty years including own investigations and some new results. In Section 1 after recalling the most important notions from formal language theory we illustr...
متن کاملCrucial Words for Abelian Powers
In 1961, Erdős asked whether or not there exist words of arbitrary length over a fixed finite alphabet that avoid patterns of the form XX ′ where X ′ is a permutation of X (called abelian squares). This problem has since been solved in the affirmative in a series of papers from 1968 to 1992. Much less is known in the case of abelian k-th powers, i.e., words of the form X1X2 . . . Xk where Xi is...
متن کاملBinary De Bruijn Partial Words with One Hole
In this paper, we investigate partial words, or finite sequences that may have some undefined positions called holes, of maximum subword complexity. The subword complexity function of a partial word w over a given alphabet of size k assigns to each positive integer n, the number pw(n) of distinct full words over the alphabet that are compatible with factors of length n of w. For positive intege...
متن کاملDeleting Powers in Words
We consider the language consisting of all words such that it is possible to obtain the empty word by iteratively deleting powers. It turns out that in the case of deleting squares in binary words this language is regular, and in the case of deleting squares in words over a larger alphabet the language is not regular. However, for deleting squares over any alphabet we find that this language ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2015
ISSN: 0012-365X
DOI: 10.1016/j.disc.2015.05.025